Dynamic Joint Scheduling and Congestion Control in Wireless Networks

The network nodes that are connected by wireless data connections called as wireless networks. The devices are connected via wireless link to communicate with each other. In wireless networks, it is very difficult to maintain the trade-off between throughput and delay. This paper proposes a new joint scheduling and congestion control algorithm for multihop wireless networks with dynamic route flows. The proposed algorithm achieves a provable throughput guarantee and provable end-to-end delay of every flow. The new joint scheduling and congestion control algorithm improves throughput and delay for dynamic wireless network by changing scheduling scheme with virtual adaptation model. The proposed algorithm combines window-based flow control with a new rate based distributed scheduling algorithm and maximum weight scheduling algorithm. This approach adaptively selects a set of routes according to the traffic load. Furthermore this dynamic adaptation mechanism achieves better performance in terms of throughput, end-to-end delay and drop rate.